Papers with end task
Farewell to Aimless Large-scale Pretraining: Influential Subset Selection for Language Model (2023.findings-acl)
Copied to clipboard
Xiao Wang, Weikang Zhou, Qi Zhang, Jie Zhou, SongYang Gao, Junzhe Wang, Menghan Zhang, Xiang Gao, Yun Wen Chen, Tao Gui
| Challenge: | Pretrained language models have achieved remarkable success in various natural language processing tasks. |
| Approach: | They propose to use end-task knowledge to select a tiny subset of pretraining corpus to influence performance. |
| Outcome: | The proposed model outperforms pretrained models on eight datasets covering four domains with 0.45% of the data and a three-orders-of-magnitude lower computational cost. |
Transferring General Multimodal Pretrained Models to Text Recognition (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for text recognition rely on large-scale pretraining on human-annotated or synthetic data. |
| Approach: | They propose a method to transfer multimodal pretrained models to text recognition using image captioning. |
| Outcome: | The proposed method outperforms the baselines and achieves state-of-the-art performance in the Chinese text recognition benchmark. |
Discrete Cosine Transform as Universal Sentence Encoder (2021.acl-short)
Copied to clipboard
| Challenge: | Modern sentence encoders capture underlying linguistic characteristics of words . Discrete Cosine Transform (DCT) is an efficient alternative to averaging . |
| Approach: | They propose to use a Discrete Cosine Transform to generate universal sentence representations in different languages. |
| Outcome: | The proposed model captures the underlying syntactic characteristics of a given text without compromising practical efficiency. |
Evaluating Discourse in Structured Text Representations (P19-1)
Copied to clipboard
| Challenge: | Discourse structure is integral to understanding a text and is useful in many NLP tasks. |
| Approach: | They propose a structured attention mechanism for text classification that derives a tree over a text, akin to an RST discourse tree. |
| Outcome: | The proposed model improves performance on multiple discourse-relevant tasks and datasets and ablation studies show it does little to capture discourse structure. |
A Closer Look at How Fine-tuning Changes BERT (2022.acl-long)
Copied to clipboard
| Challenge: | Pre-trained contextualized representations are used to analyze information in NLP . however, how fine-tuning changes the underlying embedding space is less studied . |
| Approach: | They propose to use probing techniques to analyze how fine-tuning changes the embedding space of pre-trained contextualized representations. |
| Outcome: | The proposed model improves classification performance by increasing the distances between examples associated with different labels. |
GUMsley: Evaluating Entity Salience in Summarization for 12 English Genres (2024.eacl-long)
Copied to clipboard
| Challenge: | Existing work on salient entity extraction relies on crowdsourcing or user statistics to derive labels for entities. |
| Approach: | They propose a dataset that defines salience using human summaries and shows high agreement between annotations based on whether a source entity is mentioned in the summary. |
| Outcome: | The proposed dataset shows that pre-trained models and zero-shot LLM prompting fail to capture salient entities in generated summaries. |
Deep Probabilistic Logic: A Unifying Framework for Indirect Supervision (D18-1)
Copied to clipboard
| Challenge: | Indirect supervision is a promising direction to address the annotation bottleneck . end-to-end modeling with probabilistic logic is often intractable due to inference and learning . |
| Approach: | They propose a framework for indirect supervision that integrates deep learning with deep learning by combining probabilistic logic with deep-learning. |
| Outcome: | Experiments on biomedical machine reading demonstrate the potential of this framework. |
OKGIT: Open Knowledge Graph Link Prediction with Implicit Types (2021.findings-acl)
Copied to clipboard
| Challenge: | Open Knowledge Graphs (OpenKGs) are sparse and not directly usable in an end task. |
| Approach: | They propose a method that bootstraps OpenKGs from a corpus using OpenIE tools. |
| Outcome: | The proposed method achieves state-of-the-art performance while producing type compatible NPs in the link prediction task. |
What-if I ask you to explain: Explaining the effects of perturbations in procedural text (2020.findings-emnlp)
Copied to clipboard
| Challenge: | QUARTET constructs explanations from paragraphs using procedural text . qartet achieves 18 points better on explanation accuracy compared to strong baselines on a recent process comprehension benchmark. |
| Approach: | They propose a system that constructs explanations from paragraphs by modeling the explanation task as a multitask learning problem. |
| Outcome: | The proposed system achieves 18 points better on explanation accuracy compared to strong baselines on a process comprehension benchmark. |
Tiered Reasoning for Intuitive Physics: Toward Verifiable Commonsense Language Understanding (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Large-scale, pre-trained language models (LMs) have achieved human-level performance on a breadth of language understanding tasks. |
| Approach: | They propose a commonsense reasoning dataset with dense annotations that allows multi-tiered evaluation of machines’ reasoning process. |
| Outcome: | The proposed model can achieve high end performance but struggle to support predictions with valid supporting evidence. |
Paired Examples as Indirect Supervision in Latent Decision Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | a new method to learn compositional structured models is needed . end-task supervision provides only a weak indirect signal on values the latent decisions should take. |
| Approach: | They propose a way to leverage paired examples that provide stronger cues for learning latent decisions . they use a DROP dataset to acquire paired questions that provide strong cue signals . |
| Outcome: | The proposed approach improves compositional question answering on a DROP dataset. |
Exploring Design Choices for Building Language-Specific LLMs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Prior work focused on building multilingual models that cover a broad spectrum of languages. |
| Approach: | They conduct systematic experiments on how design choices impact the adapted LLM, both in terms of efficiency and end task performance. |
| Outcome: | The proposed model performs better on English-centric models than multilingual models despite poor performance on low-resource languages. |
Learning Together to Perform Better: Teaching Small-Scale LLMs to Collaborate via Preferential Rationale Tuning (2025.acl-long)
Copied to clipboard
| Challenge: | Prior studies have demonstrated that LLMs generate step-by-step rationales, but limited data is available to improve their performance in commercial settings due to copyright and legal issues. |
| Approach: | They propose a trainable framework that tunes a (small) LLM to generate outputs from a pool of diverse rationales that selectively improves the downstream task. |
| Outcome: | The proposed framework outperforms several trainable and prompting baselines on maths problem solving, natural language inference, and commonsense reasoning. |
Rethinking the Role of Demonstrations: What Makes In-Context Learning Work? (2022.emnlp-main)
Copied to clipboard
Sewon Min, Xinxi Lyu, Ari Holtzman, Mikel Artetxe, Mike Lewis, Hannaneh Hajishirzi, Luke Zettlemoyer
| Challenge: | Large language models can in-context learn by conditioning on a few input-label pairs and making predictions for new inputs. |
| Approach: | They propose to use ground truth demonstrations to replace labels in demonstrations . they also show that other aspects of the demonstrations are key drivers of endtask performance . |
| Outcome: | The proposed model outperforms zeroshot inference on a wide range of tasks using ground truth demonstrations. |
Arctic-Text2SQL-R1: Simple Rewards, Strong Reasoning in Text-to-SQL (2026.findings-acl)
Copied to clipboard
Zhewei Yao, Guoheng Sun, Łukasz Borchmann, Zheyu Shen, Minghang Deng, Bohan Zhai, Hao Zhang, Ang Li, Yuxiong He
| Challenge: | Translating natural language questions into SQL is a core challenge in natural language understanding and human-computer interaction. |
| Approach: | They propose a reinforcement learning framework and model family to generate accurate, executable SQL using a lightweight reward signal based solely on execution correctness. |
| Outcome: | The proposed framework outperforms previous versions of 70B-class systems and achieves state-of-the-art execution accuracy across six diverse Text2SQL benchmarks. |